Parallel Algorithm for Maximum Weight Matching in Trees
نویسنده
چکیده
Unfortunately, theoretical results from PRAM algorithms do not necessarily match the speedups observed on real parallel machines. In this paper, we present a parallel algorithm that is more practical in that the assumption and cost model used reflect better the reality of commercially available multiprocessors. More precisely, we will use a version of the BSP model [6], referred to as the coarse grained multicomputer (CGM) model. In comparison to the BSP model, the CGM [2] allows only bulk messages in order to minimize message overhead costs. A CGM is
منابع مشابه
Coarse grained parallel algorithms for graph matching
Parallel graph algorithm design is a very well studied topic. Many results have been presented for the PRAM model. However, these algorithms are inherently fine grained and experiments show that PRAM algorithms do often not achieve the expected speedup on real machines because of large message overheads. In this paper, we present coarse grained parallel graph algorithms with small message overh...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملA Self-Stabilizing Algorithm for Maximum Matching in Trees
Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many eecient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a distributed, self-stabilizing algorithm for nding a maximum matching in trees. Since our algorithm...
متن کاملAn adjustable linear time parallel algorithm for maximum weight bipartite matching
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O( ω ) using O(nmax(2ω,4+ω)) processing elements for ω ≥ 1. Parameter ω is not bounded. This is the fastest known strongly polynomial parallel algorithm to solve this problem. This is also the first adjustable parallel algorithm for the maximum weight bipartite...
متن کاملAn Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
A widely used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure is only concerned with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees wit...
متن کامل